翻訳と辞書 |
Bidiakis cube : ウィキペディア英語版 | Bidiakis cube
In the mathematical field of graph theory, the Bidiakis cube is a 3-regular graph with 12 vertices and 18 edges. ==Construction== The Bidiakis cube is a cubic Hamiltonian graph and can be defined by the LCF notation ()4. The Bidiakis cube can also be constructed from a cube by adding edges across the top and bottom faces which connect the centres of opposite sides of the faces. The two additional edges need to be perpendicular to each other. With this construction, the Bidiakis cube is a polyhedral graph, and can be realized as a convex polyhedron. Therefore, by Steinitz's theorem, it is a 3-vertex-connected simple planar graph.〔Branko Grünbaum, ''Convex Polytopes'', 2nd edition, prepared by Volker Kaibel, Victor Klee, and Günter M. Ziegler, 2003, ISBN 0-387-40409-0, ISBN 978-0-387-40409-7, 466pp. 〕
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Bidiakis cube」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|